- mixed linear programming
- 混合线性规划
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
mixed linear programming
Look at other dictionaries:
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Mixed linear complementarity problem — In mathematical optimization theory, the mixed linear complementarity problem, often abbreviated as MLCP or LMCP, is a generalization of the linear complementarity problem to include free variables. References Complementarity problems Algorithms… … Wikipedia
GNU Linear Programming Kit — Original author(s) Andrew O. Makhorin Developer(s) GNU Project Stable release 4.47 / September 9, 2011; 51 days ago ( … Wikipedia
Mixed complementarity problem — (MCP) is a problem formulation in mathematical programming. Many well known problem types are special cases of, or may be reduced to MCP. It is a generalization of Nonlinear complementarity problem (NCP). Definition The mixed complementarity… … Wikipedia
Linear partial information — (LPI) is a method of making decisions based on insufficient or fuzzy information. LPI was introduced in 1970 by Polish Swiss mathematician Edward Kofler (1911 2007) to simplify decision processes. Comparing to other methods the LPI fuzziness is… … Wikipedia
Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Ch (computer programming) — In computing, Ch ( /ˌsiːˈ … Wikipedia
COIN-OR — –Infobox Organization name = COIN OR image border = size = 80x80 caption = formation = 2000 type = headquarters = location = membership = language = leader title = leader name = key people = num staff = budget = website = http://www.coin… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Cutting-plane method — In mathematical optimization, the cutting plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are popularly used to… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
